On z-factorization and c-factorization of standard episturmian words
نویسندگان
چکیده
منابع مشابه
On z-factorization and c-factorization of standard episturmian words
Ziv-Lempel and Crochemore factorization are two kinds of factorizations of words related to text processing. In this paper, we find these factorizations for standard epiesturmian words. Thus the previously known c-factorization of standard Sturmian words is provided as a special case. Moreover, the two factorizations are compared.
متن کاملInequalities characterizing standard Sturmian and episturmian words
Considering the smallest and the greatest factorswith respect to the lexicographic orderwe associate to each infinite word r two other infinite words min(r) and max(r). In this paper we prove that the inequalities as min(s) max(s) bs characterize standard Sturmian words (proper ones and periodic ones) and that the condition “for any x ∈ A and lexicographic order< satisfying x=min(A) one has xs ...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملLyndon Factorization of Infinite Words
Innnite Lyndon words have been introduced in 1], where the authors proved a factorization theorem for innnite words: any inn-nite word can be written as a non increasing product of Lyndon words, nite and/or innnite. After giving a new characterization of innnite Lyn-don words, we concentrate on three well known innnite words and give their factorization. We conclude by giving an application to ...
متن کاملOn θ-Episturmian Words
In this paper we study a class of infinite words on a finite alphabet A whose factors are closed under the image of an involutory antimorphism θ of the free monoid A∗. We show that given a recurrent infinite word ω ∈ AN, if there exists a positive integer K such that for each n ≥ 1 the word ω has 1) cardA + (n − 1)K distinct factors of length n, and 2) a unique right and a unique left special f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.05.035